Fast computation of generic bivariate resultants
نویسندگان
چکیده
We prove that the resultant of two “sufficiently generic” bivariate polynomials over a finite field can be computed in quasi-linear expected time, using randomized algorithm Las Vegas type. A similar complexity bound is proved for computation lexicographical Gröbner basis ideal generated by polynomials.
منابع مشابه
Fast computation of special resultants
We propose fast algorithms for computing composed products and composed sums, as well as diamond products of univariate polynomials. These operations correspond to special multivariate resultants, that we compute using power sums of roots of polynomials, by means of their generating series.
متن کاملBounds for resultants of univariate and bivariate polynomials
Article history: Received 23 August 2008 Accepted 3 August 2009 Available online xxxx Submitted by V. Olshevsky AMS classification: 11C20 11S05 15A60 13F20
متن کاملResultants for Unmixed Bivariate Polynomial Systems using the Dixon formulation
A necessary and sufficient condition on the support of a generic unmixed bivariate polynomial system is identified such that for polynomial systems with such support, the Dixon resultant formulation produces their resultants. It is shown that Sylvester-type matrices can also be obtained for such polynomial systems. These results are shown to be a generalization of related results recently repor...
متن کاملResultants, Resolvents and the Computation of Galois Groups
We will develop the machinery of resultants and resolvent polynomials with the ultimate goal of understanding the so-called “resolvent method” for computing Galois groups over Q. Along the way, we will encounter tangential applications of these tools, such as the determination of the minimal polynomial of, say, the sum of two algebraic numbers using resultants. In this way, this paper can serve...
متن کاملGeneric local computation
Many problems of artificial intelligence, or more generally, many problems of information processing, have a generic solution based on local computation on join trees or acyclic hypertrees. There are several variants of this method all based on the algebraic structure of valuation algebras. A strong requirement underlying this approach is that the elements of a problem decomposition form a join...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2021
ISSN: ['1090-2708', '0885-064X']
DOI: https://doi.org/10.1016/j.jco.2020.101499